Visual Cryptography for General Access Structure Using Pixel-block Aware Encoding

نویسندگان

  • Haibo Zhang
  • Xiaofei Wang
  • Wanhua Cao
  • Youpeng Huang
چکیده

Multi-pixel encoding is an emerging method in visual cryptography for that it can encode more than one pixel for each encoding run. Nevertheless, in fact its encoding efficiency is still low because of that the encoding length is invariable and very small for each run. This paper presents a novel multi-pixel encoding called pixel-block aware encoding. It scans the secret image by zigzag and perceives a pixel block with as many pixels as possible to encode for each run. A pixel-block consists of consecutive pixels of same type during the scanning. The proposed scheme has advantage in encoding efficiency over singlepixel encoding and other known multi-pixel encoding methods. Furthermore, this scheme can work well for both threshold access structure and general access structure and well for both gray-scale and chromatic images without pixel expansion. The experimental results also show that it can achieve good quality for overlapped images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

A Visual Cryptographic Technicque for Chromatic Images Using Multi-Pixel Encoding Method

Visual cryptography is a secret sharing method that uses human eyes to decrypt the secret. Most visual cryptographic methods utilize the technique of pixel expansion, which causes the size of the shares to be much larger than that of the secret image. This situation is more serious for grey-level and chromatic images. In this paper, we propose a multi-pixel encoding method for grey-level and ch...

متن کامل

Grey Level Visual Cryptography for General Access Structures

Visual cryptography, first introduced by Naor and Shamir, allows a secret (black and white) image to be encoded and distributed to a set of participants such that certain predefined sets of participants may reconstruct the image without any computation. In 2000, Blundo, De Santis, and Naor introduced a model for grey-level visual cryptography which is a generalization of visual cryptography for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCP

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2008